package NC33_合并两个排序的链表;


class ListNode {
    int val;
    ListNode next = null;

    public ListNode(int val) {
        this.val = val;
        this.next = null;
    }
}
public class Solution {
    public ListNode Merge(ListNode list1,ListNode list2){
        if (list1 == null){
            return list2;
        }
        if (list2 == null){
            return list1;
        }

        ListNode newList = new ListNode(-1);
        ListNode cur = newList;

        while (list1 != null && list2 != null){
            if (list1.val > list2.val){
                cur.next = list2;
                list2 = list2.next;
                cur = cur.next;
            }else {
                cur.next = list1;
                list1 = list1.next;
                cur = cur.next;
            }
        }

        if (list1 == null){
            cur.next = list2;
        }

        if (list2 == null){
            cur.next = list1;
        }

        return newList.next;
    }
}
